Analysis of a Queue with General Service Demands and Multiple Servers with Variable Service Capacities

نویسندگان

چکیده

We present the study of a non-classical discrete-time queuing system in which customers each request variable amount service, called their “service demand”, from with multiple servers, can provide capacity”, time slot. The service demands are independent customer to and follow general distribution, whereas capacities phase-type distribution server slot Since an exact analytical analysis for this is infeasible, we propose several approximations key performance characteristics such as mean content delay steady state. accuracy these compared simulations using numerical examples.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of an M/G/1 Queue with Multiple Vacations, N-policy, Unreliable Service Station and Repair Facility Failures

This paper studies an M/G/1 repairable queueing system with multiple vacations and N-policy, in which the service station is subject to occasional random breakdowns. When the service station breaks down, it is repaired by a repair facility. Moreover, the repair facility may fail during the repair period of the service station. The failed repair facility resumes repair after completion of its re...

متن کامل

Working Vacation Queue with Second Optional Service and Unreliable Server

An M/M/1 queueing system with second optional service and unreliable server is studied. We consider that the server works at different rate rather than being idle during the vacation period. The customers arrive to the system according to Poisson process with state dependent rates depending upon the server’s status. All customers demand the first essential service whereas only some of them dema...

متن کامل

ANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS

This paper presents the analysis of a renewal input  finite buffer queue wherein the customers can decide either to  join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed  by an underlying $m$-state Markov chain. Employing the supplementary  variable and imbedded Markov chain techniques,   the steady-state system length distributions at pre...

متن کامل

Emergency Service Vehicle Location Problem with Batch Arrival of Demands

In this paper an emergency service vehicle (ESV) location problem has been considered in which it is assumed that each emergency call may require more than one ESV. In ESV location problem two factors should be known; the location of stations and the number of ESVs at each station. Hence, a nonlinear mixed integer programming model is presented in order to maximize the total response rate to th...

متن کامل

The Discrete-Time Queue with Geometrically Distributed Service Capacities Revisited

We analyze a discrete-time queue with variable service capacity, such that the total amount of work that can be performed during each time slot is a stochastic variable that is geometrically distributed. We study the buffer occupancy by constructing an analogous model with fixed service capacity. In contrast with classical discrete-time queueing models, however, the service times in the fixed-c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11040953